#include <bits/stdc++.h>

using namespace std;

int f[210][20],n,k;
int main()
{
    cin>>n>>k;
    f[0][0] = 1;
    for(int i =1;i<=n;i++){
        for(int j = 1;j<=k;j++){
            if(i>j)f[i][j] = f[i-1][j-1]+f[i-j][j];
            else f[i][j]=f[i-1][j-1];
        }
    }
    cout<<f[n][k];
    return 0;
}
